A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg form
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for the Reduction of a Nonsymmetric Matrix to Block Upper-Hessenberg Form
In this paper, we present an algorithm for the reduction to block upper-Hessenberg form which can be used to solve the nonsymmetric eigenvalue problem on message-passing multicomputers. On such multicomputers, a nonsymmetric matrix can be distributed across processing nodes logically configured into a two-dimensional mesh using the block-cyclic data distribution. Based on the matrix partitionin...
متن کاملParallel Reduction of a Block Hessenberg-Triangular Matrix Pair to Hessenberg-Triangular Form—Algorithm Design and Performance Results
The design, implementation and performance of a parallel algorithm for reduction of a matrix pair in block upper Hessenberg-Triangular form (Hr, T ) to upper Hessenberg-triangular form (H, T ) is presented. This reduction is the second stage in a two-stage reduction of a regular matrix pair (A, B) to upper Hessenberg-Triangular from. The desired upper Hessenberg-triangular form is computed usin...
متن کاملParallel Reduction from Block Hessenberg to Hessenberg using MPI
In many scientific applications, eigenvalues of a matrix have to be computed. By first reducing a matrix from fully dense to Hessenberg form, eigenvalue computations with the QR algorithm become more efficient. Previous work on shared memory architectures has shown that the Hessenberg reduction is in some cases most efficient when performed in two stages: First reduce the matrix to block Hessen...
متن کاملReduction of a Regular Matrix Pair (A, B) to Block Hessenberg Triangular Form
An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is presented. This condensed form Q T (A; B)Z = (H; T), where H and T are block upper Hessenberg and upper triangular, respectively, and Q and Z orthogonal, may serve as a rst step in the solution of the generalized eigenvalue problem Ax = Bx. It is shown how an elementwise algorithm can be reorganize...
متن کاملEfficient Reduction from Block Hessenberg Form to Hessenberg Form Using Shared Memory
A new cache-efficient algorithm for reduction from block Hessenberg form to Hessenberg form is presented and evaluated. The algorithm targets parallel computers with shared memory. One level of look-ahead in combination with a dynamic load-balancing scheme significantly reduces the idle time and allows the use of coarse-grained tasks. The coarse tasks lead to high-performance computations on ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 1995
ISSN: 0167-8191
DOI: 10.1016/0167-8191(95)00015-g